Embedding of Conditional Graph Transformations
نویسنده
چکیده
Single pushout graph transformations at injective matches are extended by negative application conditions. It is shown, how right-sided application conditions can be transformed into equivalent left-sided ones. Based on this result, conditional derived rules are introduced and a theorem, similiar to the double pushout embedding theorem is shown. Finally, three variants of contextual application conditions are discussed with respect to their expressive power and expected results.
منابع مشابه
Detecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملTowards an embedding of Graph Transformation in Intuitionistic Linear Logic
Linear logics have been shown to be able to embed both rewriting-based approaches and process calculi in a single, declarative framework. In this paper we are exploring the embedding of double-pushout graph transformations into quantified linear logic, leading to a Curry-Howard style isomorphism between graphs / transformations and formulas / proof terms. With linear implication representing ru...
متن کاملT F S C M T G T F
In this paper, we extend our ideas on model transformations as functors discussed in the previous issue and embed this concept into the framework of graph transformation systems. We show that under certain restrictions of the rules model transformations by graph transformation are functors.
متن کاملA Graph-Based Inference Method for Conditional Independence
The graphoid axioms for conditional independence, originally described by Dawid [1979], are fundamental to probabilistic reasoning [Pearl, 1988]. Such axioms provide a mechanism for manipulating conditional independence assertions without resorting to their numerical definition. This paper explores a representation for independence statements using multiple undirected graphs and some simple gra...
متن کاملThe Embedding Problem for Switching Classes
In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labelled) graphs through local transformations of the vertices. In case vertices are given an identity, various relatively efficient algorithms exist for deciding whether a graph can be switched so that it contains some other graph...
متن کامل